Counting Instances of Software Components

نویسندگان

  • Hoang Truong
  • Marc Bezem
چکیده

Component software is software that has been assembled from variouspieces of standardized, reusable computer programs, so-called components.Executing component software creates instances of these components. Forseveral reasons, for example, limited resources and/or application require-ments, it can be important to have control over the number of such instances.Clearly, design-time or compile-time control is to be preferred to run-time con-trol in cases where this is possible. We give an abstract component languageand a type system which ensures that the number of simultaneously activeinstances of any component never exceeds a (sharp) bound expressed in thetype. The language features instantiation and reuse of components, as wellas sequential composition, choice and scope. Alternatively one can view theobjects in the language as processes where the atomic actions are interpretedas either creating new, or reusing old instances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A type system for counting instances of software components

We identify an abstract language for component software based on primitives for instantiating components and for deleting instances of components, as well as for sequential, alternative and parallel composition. We define an operational semantics for our language and give a type system in which the types express quantitative information on the components involved in the execution of the express...

متن کامل

Counting Models Using Connected Components

Recent work by Birnbaum & Lozinskii [1999] demonstrated that a clever yet simple extension of the well-known DavisPutnam procedure for solving instances of propositional satisfiability yields an efficient scheme for counting the number of satisfying assignments (models). We present a new extension, based on recursively identifying connected constraint-graph components, that substantially improv...

متن کامل

The Covered Components Polynomial: A New Representation of the Edge Elimination Polynomial

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a recurrence relation, which shows that both graph polynomials are substitution instances of each other. We give some properties of the covered components polynomial an...

متن کامل

A Type System for Usage of Software Components. Extended Abstract

The aim of this article is to support component-based software engineering by modelling exclusive and inclusive usage of software components. Truong and Bezem describe in several papers abstract languages for component software with the aim to estimate bounds for the number of instances of components. Their language includes primitives for instantiating and deleting instances of components and ...

متن کامل

Evaluation of Classifiers in Software Fault-Proneness Prediction

Reliability of software counts on its fault-prone modules. This means that the less software consists of fault-prone units the more we may trust it. Therefore, if we are able to predict the number of fault-prone modules of software, it will be possible to judge the software reliability. In predicting software fault-prone modules, one of the contributing features is software metric by which one ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004